Fast-phase space computation of multiple arrivals

Fast-phase space computation of multiple arrivals.

We present a fast, general computational technique for computing the phase-space solution of static Hamilton-Jacobi equations. Starting with the Liouville formulation of the characteristic equations, we derive "Escape Equations" which are static, time-independent Eulerian PDEs. They represent all arrivals to the given boundary from all possible starting configurations. The solution is numerical...

Fast Computation of Good Multiple Spaced Seeds

Homology search finds similar segments between two biological sequences, such as DNA or protein sequences. A significant fraction of computing power in the world is dedicated to performing such tasks. The introduction of optimal spaced seeds by Ma et al. has increased both the sensitivity and the speed of homology search and it has been adopted by many alignment programs such as BLAST. With the...

Computation of Configuration-Space Obstacles Using the Fast Fourier Tkansform

Thh paper presents a new method for computing the configuration-space map of obstacles that is used in motion-planning algorithms. The method derives from the observation that, when the robot is a rigid object that can only translate, the configuration space is a convolution of the workspace and the robot. This convolution is computed with the use of the Fast Fourier Transform (FFT) algorithm. ...

Computation of Configuration-Space Obstacles Using the Fast Fourier Transform

Simple and fast linear space computation of longest common subsequences

Given two sequences A = a1a2 . . . am and B = b1b2 . . . bn, m 6 n, over some alphabet Σ of size s the longest common subsequence (LCS) problem is to find a sequence of greatest possible length that can be obtained from both A and B by deleting zero or more (not necessarily adjacent) symbols. Applications for the LCS problem arise in many different areas since the length, p, of a longest common...